Approximation algorithms for covering/packing integer programs
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for covering/packing integer programs
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{cx : x ∈ Z+, Ax ≥ a, Bx ≤ b, x ≤ d}. We give a bicriteria-approximation algorithm that, given ε ∈ (0, 1], finds a solution of cost O(ln(m)/ε) times optimal, meeting the covering constraints (Ax ≥ a) and multiplicity constraints (x ≤ d), and satisfying Bx ≤ (1 + ε)b + β, wher...
متن کاملApproximation Algorithms Based on Lp Relaxation 1 Linear Programs and Linear Integer Programs
There are two fundamental approximation algorithm design techniques based on linear programming: (a) LP-relaxation and rounding, and (b) the primal-dual method. In this lecture note, we will discuss the former. The idea of LP-relaxation and rounding is quite simple. We first formulate an optimization problem as an integer program (IP), which is like a linear program (LP) with integer variables....
متن کاملTight Bounds and Approximation Algorithms for Integer Programs with Two Variables per Inequality
The problem of integer programming in bounded variables over constraints with no more than two variables in each constraint is NP complete even when all variables are binary This paper deals with integer linear minimization problems in n variables subject to m linear constraints with at most two variables per inequality and with all variables bounded between and U For such systems a approximati...
متن کاملPrimal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for the...
متن کاملPrimal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approxima.tion algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover [BRS89] [LN93], th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2005
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2005.05.002